Weighted height of random trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Profile and Height of Random Binary Search Trees

The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.

متن کامل

The height of random binary unlabelled trees

This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size n is proved to have a limiting theta distribution, both in a central and local sense. Moderate as well as large deviations estimates are also derived. The proofs rely on the analysis (in the complex plane) of generating fun...

متن کامل

On Weighted Heights of Random Trees

Consider the family tree T of a branching process starting from a single progenitor and conditioned to have v=v(T) edges (total progeny). To each e d g e ( e ) we associate a weight W(e). The weights are i.i.d, random variables and independent of T. The weighted height of a self-avoiding path in T starting at the root is the sum of the weights associated with the path. We are interested in the ...

متن کامل

The Height and Size of Random Hash Trees and Random Pebbled Hash Trees

The random hash tree and the N-tree were introduced by Ehrlich in 1981. In the random hash tree, n data points are hashed to values X1, . . . , Xn, independently and identically distributed random variables taking values that are uniformly distributed on [0, 1]. Place the Xi’s in n equal-sized buckets as in hashing with chaining. For each bucket with at least two points, repeat the same process...

متن کامل

The height of scaled attachment random recursive trees

We study depth properties of a general class of random recursive trees where each node n attaches to the random node !nXn" and X0, . . . , Xn is a sequence of i.i.d. random variables taking values in [0, 1). We call such trees scaled attachment random recursive trees (SARRT). We prove that the height Hn of a SARRT is asymptotically given by Hn ∼ αmax log n where αmax is a constant depending onl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Informatica

سال: 2008

ISSN: 0001-5903,1432-0525

DOI: 10.1007/s00236-008-0069-0